- Cartesian product graph
- Математика: декартово произведение графов
Универсальный англо-русский словарь. Академик.ру. 2011.
Cartesian product graph
Смотреть что такое "Cartesian product graph" в других словарях:
Cartesian product of graphs — In graph theory, the cartesian product G ◻ H of graphs G and H is a graph such that * the vertex set of G ◻ H is the cartesian product V(G) × V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G ◻ H if and only if either ** u = v and … Wikipedia
Cartesian product — Cartesian square redirects here. For Cartesian squares in category theory, see Cartesian square (category theory). In mathematics, a Cartesian product (or product set) is a construction to build a new set out of a number of given sets. Each… … Wikipedia
Graph operations — Operations on graphs produce new graphs from old ones. They may be separated into the following major categories. Contents 1 Unary operations 1.1 Elementary operations 1.2 Advanced operations 2 … Wikipedia
Cartesian coordinate system — Illustration of a Cartesian coordinate plane. Four points are marked and labeled with their coordinates: (2, 3) in green, (−3, 1) in red, (−1.5, −2.5) in blue, and the origin (0, 0) in purple. A Cartesian coordinate system specifies each point… … Wikipedia
Graph product — A graph product is a binary operation on graphs. There are several similarly defined operations on graphs, called product . Given two graphs G1 and G2 , their product H is a graph such that * the vertex set of H is the Cartesian product V(G 1)… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
Kronecker product — In mathematics, the Kronecker product, denoted by otimes, is an operation on two matrices of arbitrary size resulting in a block matrix. It is a special case of a tensor product. The Kronecker product should not be confused with the usual matrix… … Wikipedia
Tensor product of graphs — In graph theory, the tensor product G × H of graphs G and H is a graph such that * the vertex set of G × H is the Cartesian product V(G) × V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G × H if and only if u is adjacent with v… … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Lexicographic product of graphs — In graph theory, the lexicographic product or graph composition G ∙ H of graphs G and H is a graph such that * the vertex set of G ∙ H is the cartesian product V(G) imes V(H) ; and * any two vertices (u,u ) and (v,v ) are adjacent in G ∙ H if and … Wikipedia
Modular product of graphs — The modular product of graphs. In graph theory, the modular product of graphs G and H is a graph such that the vertex set of the modular product of G and H is the cartesian product V(G) × V(H); and any two vertices (u, v) and (u… … Wikipedia
